Classical mereology is not elementarily axiomatizable

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What is Classical Mereology?

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are no...

متن کامل

ML is not finitely axiomatizable over Cheq

We show that the Medvedev logic ML is not finitely axiomatizable over the logic Cheq of chequered subsets of R∞. This gives a negative solution to one of the questions raised by Litak [2].

متن کامل

natural axioms for classical mereology

We present a new axiomatization of classical mereology in which the three components of the theory—ordering, composition, and decomposition principles—are neatly separated.The equivalence of our axiom systemwith other, more familiar systems is established by purely deductivemethods, along with additional results on the relative strengths of the composition and decomposition axioms of each theor...

متن کامل

The theory of integrally closed domains is not finitely axiomatizable

It is well-known that the theory of algebraically closed fields is not finitely axiomatizable. In this note, we prove that the theory of integrally closed integral domains is also not finitely axiomatizable. All rings in this paper are assumed commutative with identity. Let L be the language of rings, that is, the language whose signature consists of equality, binary function symbols + and ·, a...

متن کامل

2-Nested Simulation Is Not Finitely Equationally Axiomatizable

2-nested simulation was introduced by Groote and Vaandrager [10] as the coarsest equivalence included in completed trace equivalence for which the tyft/tyxt format is a congruence format. In the linear time-branching time spectrum of van Glabbeek [8], 2-nested simulation is one of the few equivalences for which no finite equational axiomatization is presented. In this paper we prove that such a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logic and Logical Philosophy

سال: 2015

ISSN: 2300-9802,1425-3305

DOI: 10.12775/llp.2015.017